منابع مشابه
Implicit Resolution
Let Ω be a set of unsatisfiable clauses, an implicit resolution refutation of Ω is a circuit β with a resolution proof α of the statement “β describes a correct tree-like resolution refutation of Ω”. We show that such a system is p-equivalent to Extended Frege. More generally, let τ be a tautology, a [P,Q]-proof of τ is a pair (α, β) s.t. α is a P -proof of the statement “β is a circuit describ...
متن کاملRelaxed resolution of implicit equations ∗
The technique of relaxed power series expansion provides an efficient way to solve equations of the form F =Φ(F ), where the unknown F is a vector of power series, and where the solution can be obtained as the limit of the sequence 0,Φ(0),Φ(Φ(0)), . With respect to other techniques, such as Newton’s method, two major advantages are its generality and the fact that it takes advantage of possible...
متن کاملSources of Evidence for Implicit Argument Resolution
Traditionally, semantic role labelling systems have focused on searching the fillers of those explicit roles appearing within sentence boundaries. However, when the participants of a predicate are implicit and can not be found inside sentence boundaries, this approach obtains incomplete predicative structures with null arguments. Previous research facing this task have coincided in identifying ...
متن کاملArbitrary 3D Resolution Discrete Ray Tracing of Implicit Surfaces
A new approach to ray tracing implicit surfaces based on recursive space subdivision is presented in this paper. Interval arithmetic, already used to calculate intersections in ray tracing and ray casting (numerically or subdividing 1D or 2D spaces), is now used here to implement a ray tracing based on reliable rays traversals into a potentially infinite octree-like subdivided space, eliminatin...
متن کاملCasting Implicit Role Linking as an Anaphora Resolution Task
Linking implicit semantic roles is a challenging problem in discourse processing. Unlike prior work inspired by SRL, we cast this problem as an anaphora resolution task and embed it in an entity-based coreference resolution (CR) architecture. Our experiments clearly show that CR-oriented features yield strongest performance exceeding a strong baseline. We address the problem of data sparsity by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2013
ISSN: 1860-5974
DOI: 10.2168/lmcs-9(4:7)2013